Mespotine-RLE-basic v0.9 - An overhead-reduced and improved Run-Length-Encoding Method

نویسنده

  • Meo Mespotine
چکیده

Run Length Encoding(RLE) is one of the oldest algorithms for data-compression available, a method used for compression of large data into smaller and therefore more compact data. It compresses by looking at the data for repetitions of the same character in a row and storing the amount(called run) and the respective character(called run_value) as target-data. Unfortunately it only compresses within strict and special cases. Outside of these cases, it increases the data-size, even doubles the size in worst cases compared to the original, unprocessed data. In this paper, we will discuss modifications to RLE, with which we will only store the run for characters, that are actually compressible, getting rid of a lot of useless data like the runs of the characters, that are uncompressible in the first place. This will be achieved by storing the character first and the run second. Additionally we create a bit-list of 256 positions(one for every possible ASCII-character), in which we will store, if a specific (ASCII-)character is compressible(1) or not(0). Using this list, we can now say, if a character is compressible (store [the character]+[it's run]) or if it is not compressible (store [the character] only and the next character is NOT a run, but the following character instead). Using this list, we can also successfully decode the data(if the character is compressible, the next character is a run, if not compressible, the next character is a normal character). With that, we store runs only for characters, that are compressible in the first place. In fact, in the worst case scenario, the encoded data will create always just an overhead of the size of the bit-list itself. With an alphabet of 256 different characters(i.e. ASCII) it would be only a maximum of 32 bytes, no matter how big the original data was. Many image/audio/video-formats who apply Standard-RLE(FLAC, TIFF, etc), could benefit from Mespotine-RLE heavily by getting rid of the negative side-effects of Standard-RLE. Even datacompression programs that use RLE as main compression-method or as a pre-processor, could be improved by Mespotine-RLE. Mespotine, Méô: “Mespotine-RLE-basic 0.9, an overhead-reduced & improved Run-Length-Encoding Method”, 2015 trss.mespotine.de, [email protected]

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Image Compression Using Proposed Enhanced Run Length Encoding Algorithm

In this paper, we will present p roposed enhance process of image compression by using RLE algorithm. This proposed yield to decrease the size of compressing image, but the original method used primarily for compressing a binary images [1].Which will yield increasing the size of an original image mostly when used for color images. The test of an enhanced algorithm is performed on sample consist...

متن کامل

Comparison of Image Compression Techniques for MRI Brain Image

Run length encoding (RLE) is the method that allows the data compression for information in which pixels are replaced constantly. This paper examines the performance of the RLE algorithm. To compression the image is evaluate and compared. Medical image compression techniques irrelevance and redundancy of the image data in order to be able to store or transmit data in an efficient form. It’s use...

متن کامل

MPI Reduction Operations for Sparse Floating-point Data

This paper presents a pipeline algorithm for MPI Reduce that uses a Run Length Encoding (RLE) scheme to improve the global reduction of sparse floating-point data. The RLE scheme is directly incorporated into the reduction process and causes only low overheads in the worst case. The high throughput of the RLE scheme allows performance improvements when using high performance interconnects, too....

متن کامل

Run-length Encoding on Graphics Hardware

In this report, we present a series of improvements to the basic run-length encoding algorithm. Several modified algorithms are generated, from basic CPU single-threaded compression to a highly parallelized version on NVidia CUDA hardware. We also investigated changes to memory access locality in the parallel versions. With a comparison of the various compression times and their corresponding d...

متن کامل

Time and Space Efficient Lempel-Ziv Factorization based on Run Length Encoding

We propose a new approach for calculating the Lempel-Ziv factorization of a string, based on run length encoding (RLE). We present a conceptually simple off-line algorithm based on a variant of suffix arrays, as well as an on-line algorithm based on a variant of directed acyclic word graphs (DAWGs). Both algorithms run in O(N + n log n) time and O(n) extra space, where N is the size of the stri...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1501.05542  شماره 

صفحات  -

تاریخ انتشار 2015